Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)
نویسنده
چکیده
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information satisfies a formula expressed in a modal multi-agent logic of knowledge. The optimization has been implemented in the epistemic model checker MCK. The paper reports experimental results demonstrating that it can yield multiple orders of magnitude performance improvements.
منابع مشابه
Epistemic Model Checking Using Conditional Independence ( Extended
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information satisfies a formula expressed in a modal multi-agent logic of knowledge. The optimization has been implemented in the epistemic model checker MCK. The paper reports experimental results demons...
متن کاملOptimizing Epistemic Model Checking using Conditional Independence
Conditional independence reasoning has been shown to be helpful in the context of Bayesian nets to optimize probabilistic inference, and related techniques have been applied to speed up a number of logical reasoning tasks in boolean logic by eliminating irrelevant parts of the formulas. This paper shows that conditional independence reasoning can also be applied to optimize epistemic model chec...
متن کاملAFRL-AFOSR-JP-TR-2017-0017 Independence-based Optimization of Epistemic Model Checking
Epistemic model checking is an automated verification methodology that enables multi-agent and concurrent systems and models to be verified with respect to properties concerning the information possessed by the agents, and how this information changes over time. The project investigated an approach the optimization of epistemic model checking using reasoning about independencies detected by mea...
متن کاملAn Epistemic Strategy Logic (Extended Abstract)
The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents. Some examples are presented to motivate the framework, and relationships to several variants of alternating temporal epistemic logic are discussed...
متن کاملImproved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic∗ (Extended Abstract)
The paper develops a new approach to bounded model checking for a logic of knowledge and branching time. Experimental results are presented that demonstrate improved model checking performance, compared with previous approaches, on a range of examples.
متن کامل